From rational Gödel logic to ultrametric logic
نویسندگان
چکیده
منابع مشابه
Extending possibilistic logic over Gödel logic
In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter ...
متن کاملTowards Rational Closure for Fuzzy Logic: The Case of Propositional Gödel Logic
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark and we are going to see whether such a construction can be adopted in the context of mathematical fuzzy logic, a so far (apparently) unexplored journey. As a first step, we will characterise rational closure in the context of Propositional Gödel Logic.
متن کاملGödel logic: From natural deduction to parallel computation
Propositional Gödel logic G extends intuitionistic logic with the non-constructive principle of linearity (A→ B) ∨ (B → A). We introduce a Curry–Howard correspondence for G and show that a simple natural deduction calculus can be used as a typing system. The resulting functional language extends the simply typed λ-calculus via a synchronous communication mechanism between parallel processes, wh...
متن کاملUltrametric Spaces in Continuous Logic
We investigate the continuous model theory of ultrametric spaces of diameter ≤ 1. There is no universal Polish ultrametric space of diameter 1; but there is a Polish ultrametric space, Umax, taking distances in Q∩[0, 1], which is universal for all such Polish ultrametric spaces. We show that in the continuous theory of Umax, nonforking is characterized by a stable independence relation, which i...
متن کاملMonotone operators on Gödel logic
4 We consider an extension of Gödel logic by a unary operator that enables the addition of nonnegative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π2-hard. We explain the close connection to Scarpellini’s result on Π2hardness of Łukasiewicz’s logic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2014
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exu065